分数阶终端滑模控制器在DTC系统中的应用

针对SVPWM调制的永磁同步电机直接转矩控制系统磁链和转矩波动较大的问题,结合非奇异终端滑模和分数阶微积分理论的特点,设计了一种分数阶非奇异终端滑模控制器。结合直接转矩原理和分数阶微积分理论,对误差进行分数阶微分后与误差之和作为滑模面;根据非奇异终端滑模控制原理,在所设计分数阶滑模面的基础上确定了相应的控制律;利用李亚普诺夫定理证明了滑模面的稳定性和可达性。仿真结果表明,该策略能提高系统的动静态性能,可以进一步抑制磁链和转矩波动。     

Bullwhip and reverse bullwhip effects under the rationing game

When an unreliable supplier serves multiple retailers, the retailers may compete with each other by inflating their order quantities in order to obtain their desired allocation from the supplier, a behavior known as the rationing game. We introduce capacity information sharing and a capacity reservation mechanism in the rationing game and show that a Nash equilibrium always exists. Moreover, we provide conditions guaranteeing the existence of the reverse bullwhip effect upstream, a consequence of the disruption caused by the supplier. In contrast, we also provide conditions under which the bullwhip effect does not exist. In addition, we show that a smaller unit reservation payment leads to more bullwhip and reverse bullwhip effects, while a large unit underage cost results in a more severe bullwhip effect. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 203–216, 2017     

An absolute approximation algorithm for scheduling unrelated machines

Non‐preemptive scheduling of n independent jobs on m unrelated machines so as to minimize the maximal job completion time is considered. A polynomial algorithm with the worst‐case absolute error of min{(1 ? 1/m)p_max, p} is presented, where p_max is the largest job processing time and p is the mth element from the non‐increasing list of job processing times. This is better than the earlier known best absolute error of p_max. The algorithm is based on the rounding of acyclic multiprocessor distributions. An O(nm²) algorithm for the construction of an acyclic multiprocessor distribution is also presented. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

A heuristic for maximizing the number of on‐time jobs on two uniform parallel machines

We consider the problem of maximizing the number of on‐time jobs on two uniform parallel machines. We show that a straightforward extension of an algorithm developed for the simpler two identical parallel machines problem yields a heuristic with a worst‐case ratio bound of at least . We then show that the infusion of a “look ahead” feature into the aforementioned algorithm results in a heuristic with the tight worst‐case ratio bound of , which, to our knowledge, is the tightest worst‐case ratio bound available for the problem. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

海军军事数据在指挥控制中的作用及层次关联分析

信息化条件下的海上作战中,数据的重要性不断凸显,数据建设已成为信息化建设的核心内容之一,加强数据研究愈发重要,因此以海军军事数据为研究对象,论述海军军事数据在指挥控制中的作用、特点,重点以海军水面舰艇作战能力数据为研究对象,对海军军事数据之间的层次关联性进行了分析研究,建立了海军水面舰艇作战能力数据的层次关系模型,为海军军事数据的进一步深入研究打下基础。     

Bolstering components for maximizing system lifetime

This article considers the problem of which component should be “bolstered” or “improved” in order to stochastically maximize the lifetime of a parallel system, series system, or in general, k-out-of-n system. Various ways of bolstering including active redundance, standby redundancy, and burn-in are studied. Also the method of reducing working temperature or stress level according to Arrhenius models is investigated. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 497–509, 1998     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Convolutions and generalization of logconcavity: Implications and applications

Additive convolution of unimodal and α‐unimodal random variables are known as an old classic problem which has attracted the attention of many authors in theory and applied fields. Another type of convolution, called multiplicative convolution, is rather younger. In this article, we first focus on this newer concept and obtain several useful results in which the most important ones is that if is logconcave then so are and for some suitable increasing functions ?. This result contains and as two more important special cases. Furthermore, one table including more applied distributions comparing logconcavity of f(x) and and two comprehensive implications charts are provided. Then, these fundamental results are applied to aging properties, existence of moments and several kinds of ordered random variables. Multiplicative strong unimodality in the discrete case is also introduced and its properties are investigated. In the second part of the article, some refinements are made for additive convolutions. A remaining open problem is completed and a conjecture concerning convolution of discrete α‐unimodal distributions is settled. Then, we shall show that an existing result regarding convolution of symmetric discrete unimodal distributions is not correct and an easy alternative proof is presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 109–123, 2016     

军事行政区主轴线空间节点秩序构建

结合营区规划实例,以军事行政区主轴线为研究对象,在分析现阶段军事行政区主轴线空间节点设计中比较集中存在的几个问题基础上,提出了构建军事行政区主轴线空间节点秩序及应遵循的一般原则,并以常见的入口区—广场区—办公区—训练区的轴线构成为例,对军事行政区主轴线各空间节点的秩序构建进行了空间、尺度及人性化等设计方法的探讨,为推动营区规划的正规化、现代化建设提供一些思路和方法。     

Optimal job splitting on a multi‐slot machine with applications in the printing industry

In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010